Solution plans and interactive problem solving
نویسندگان
چکیده
منابع مشابه
Selectively Generalizing Plans for Problem-Solving
Abst ract Problem solving programs that generalize and save plans in order to improve their subsequent performance inevitably face the danger of being overwhelmed by an ever-increasing number of stored plans. To cope with this problem, methods must be developed for selectively learning only the most valuable aspects of a new plan. This paper describes MORRIS, a heuristic problem solver that mea...
متن کاملAddition as Interactive Problem Solving
Successful problem solving depends on a dynamic interplay of resources between agent, task, and task environment. To illuminate these interactions we studied how participants added a series of single-digit numbers presented on a computer screen. We distinguished between four different user interfaces, each implementing a different mode of interaction with the displayed addends: look only, point...
متن کاملInteractive Problem Solving in Prolog
This paper presents an environment for solving Prolog problems which has been implemented as a module for the virtual laboratory VILAB. During the problem solving processes the learners get fast adaptive feedback. As a result analysing the learner's actions the system suggests the use of suitable auxiliary predicates which will also be checked for proper implementation. The focus of the environ...
متن کاملFlexible Response Choice Using Problem-Solving Plans and Rhetorical Relations
In this paper we present an architecture for choosing a flexible response in a natural language system involved in information-seeking tasks. Our work considers the crucial issue of choosing what information to provide and how to structure it, considering from the generation perspective a model of dialogue that was previously developed to study the recognition activity of an agent. In such a mo...
متن کاملInteractive Problem Solving via Algorithm Visualization
COMIND is a tool for conceptual design of industrial products. It helps designers define and evaluate the initial design space by using search algorithms to generate sets of feasible solutions. Two algorithm visualization techniques, Kaleidoscope and Lattice, and one visualization of n-dimensional data, MAP, are used to externalize the machine’s problem solving strategies and the tradeoffs as a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Graphics
سال: 1975
ISSN: 0097-8493
DOI: 10.1016/0097-8493(75)90028-x